ImmunoglobulinλGene Rearrangement Can PrecedeκGene Rearrangement

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Immunoglobulin λ Gene Rearrangement Can Precede κ Gene Rearrangement

Immunoglobulin genes are generated during differentiation of B lymphocytes by joining gene segments. A mouse pre-B cell contains a functional immunoglobulin heavy-chain gene, but no light-chain gene. Although there is only one heavy-chain locus, there are two light-chain loci: kappa and lambda. It has been reported that kappa loci in the germ-line configuration are never (in man) or very rarely...

متن کامل

Genome Rearrangement

The difference between genome rearrangement theory and other approaches to comparative genomics, and indeed most other topics in computational molecular biology, is that it is not directly based on macromolecular sequences, either nucleic acids or proteins. Rather like classical genetics, its building blocks are genes, and the structures of interest are chromosomes, abstracted in terms of the l...

متن کامل

Aza-pinacol rearrangement: acid-catalyzed rearrangement of aziridines to imines.

A series of di-, tri-, and tetra-substituted N-tosylaziridines [N-(toluene-p-sulfonyl)aziridines] 1, prepared by aziridination of the corresponding alkenes with N-[(tolyl-p-sulfonyl)imino]phenyliodinane (TsN = IPh), was found to undergo a BF3-catalyzed rearrangement (aza-pinacol rearrangement) under mild conditions to give the corresponding N-tosylimines 2 generally in satisfactory yields.

متن کامل

DNA rearrangement can account for in vitro switching to IgG1

During immune responses, B lymphocytes may switch from the expression of immunoglobulin M (IgM) to the expression of another isotype (e.g., IgG, IgE, IgA). In stable hybridomas and myelomas expressing a "switched" (S) isotype, DNA deletions between S mu and a "downstream" S region (S region recombination) have been found. In primary B cells, studies of the molecular basis of switching have been...

متن کامل

How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation

Computing genomic distances between whole genomes is a fundamental problem in comparative genomics. Recent researches have resulted in different genomic distance definitions: number of breakpoints, number of common intervals, number of conserved intervals, Maximum Adjacency Disruption number (MAD), etc. Unfortunately, it turns out that, in presence of duplications, most problems are NP–hard, an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Developmental Immunology

سال: 1990

ISSN: 1044-6672

DOI: 10.1155/1990/56014